On weighted zero-sum sequences
نویسندگان
چکیده
منابع مشابه
On Weighted Zero - Sum Sequences Sukumar
Let G be a finite additive abelian group with exponent exp(G) = n > 1 and let A be a nonempty subset of {1, . . . , n − 1}. In this paper, we investigate the smallest positive integer m, denoted by sA(G), such that any sequence {ci}i=1 with terms from G has a length n = exp(G) subsequence {cij}nj=1 for which there are a1, . . . , an ∈ A such that ∑n j=1 aicij = 0. When G is a p-group, A contain...
متن کاملOn Short Zero-sum Subsequences of Zero-sum Sequences
Abstract. Let G be a finite abelian group, and let η(G) be the smallest integer d such that every sequence over G of length at least d contains a zero-sum subsequence T with length |T | ∈ [1, exp(G)]. In this paper, we investigate the question whether all non-cyclic finite abelian groups G share with the following property: There exists at least one integer t ∈ [exp(G)+1, η(G)− 1] such that eve...
متن کاملOn Bialostocki’s Conjecture for Zero-sum Sequences
A finite sequence S of terms from an (additive) abelian group is said to have zero-sum if the sum of the terms of S is zero. In 1961 P. Erdős, A. Ginzburg and A. Ziv [3] proved that any sequence of 2n− 1 terms from an abelian group of order n contains an n-term zero-sum subsequence. This celebrated EGZ theorem is is an important result in combinatorial number theory and it has many different ge...
متن کاملRemarks on Tiny Zero - Sum Sequences
Let G be an additive finite abelian group with exponent exp(G). Let S = g1 · . . . · gl be a sequence over G and k(S) = ord(g1)+· · ·+ord(gl) be its cross number. Let η(G) (resp. t(G)) be the smallest integer t such that every sequence of t elements (repetition allowed) from G contains a non-empty zero-sum subsequence T of length |T | ≤ exp(G) (resp. k(T ) ≤ 1). It is easy to see that t(G) ≥ η(...
متن کاملZero-sum Balanced Binary Sequences
For every positive integer n ≡ 0 mod 4, we construct a zero-sum {±1}-sequence of length n which is balanced, i.e., whose associated Steinhaus triangle contains as many +1’s as −1’s. This implies the existence of balanced binary sequences of every length m ≡ 0 or 3 mod 4, thereby providing a new solution to a problem posed by Steinhaus in 1963.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2012
ISSN: 0196-8858
DOI: 10.1016/j.aam.2011.11.007